Budget Optimization for Sponsored Search: Censored Learning in MDPs
نویسندگان
چکیده
We consider the budget optimization problem faced by an advertiser participating in repeated sponsored search auctions, seeking to maximize the number of clicks attained under that budget. We cast the budget optimization problem as a Markov Decision Process (MDP) with censored observations, and propose a learning algorithm based on the wellknown Kaplan-Meier or product-limit estimator. We validate the performance of this algorithm by comparing it to several others on a large set of search auction data from Microsoft adCenter, demonstrating fast convergence to optimal performance.
منابع مشابه
Efficient Regret Bounds for Online Bid Optimisation in Budget-Limited Sponsored Search Auctions
We study the problem of an advertising agent who needs to intelligently distribute her budget across a sequence of online keyword bidding auctions. We assume the closing price of each auction is governed by the same unknown distribution, and study the problem of making provably optimal bidding decisions. Learning the distribution is done under censored observations, i.e. the closing price of an...
متن کاملBudget Optimization for Online Advertising Campaigns with Carryover Effects
While it is relatively easy to start an online advertising campaign, proper allocation of the marketing budget is far from trivial. A major challenge faced by the marketers attempting to optimize their campaigns is in the sheer number of variables involved, the many individual decisions they make in fixing or changing these variables, and the nontrivial short and long-term interplay among these...
متن کاملAnother look at search-based drama management
A drama manager (DM) monitors an interactive experience, such as a computer game, and intervenes to shape the global experience so it satisfies the author’s expressive goals without decreasing a player’s interactive agency. In declarative optimization-based drama management (DODM), the author declaratively specifies desired properties of the experience; the DM optimizes its interventions to max...
متن کاملModels for Budget Constrained Auctions: an Application to Sponsored Search & Other Auctions
Title of dissertation: MODELS FOR BUDGET CONSTRAINED AUCTIONS: AN APPLICATION TO SPONSORED SEARCH & OTHER AUCTIONS Abhishek Pani, Doctor of Philosophy, 2010 Dissertation directed by: Professor Subramanian Raghavan Robert H. Smith School of Business The last decade has seen the emergence of auction mechanisms for pricing and allocating goods on the Internet. A successful application area for auc...
متن کاملApproximate Newton Methods for Policy Search in Markov Decision Processes
Approximate Newton methods are standard optimization tools which aim to maintain the benefits of Newton’s method, such as a fast rate of convergence, while alleviating its drawbacks, such as computationally expensive calculation or estimation of the inverse Hessian. In this work we investigate approximate Newton methods for policy optimization in Markov decision processes (MDPs). We first analy...
متن کامل